RSA Signature: Behind the Scenes
نویسندگان
چکیده
In this paper, we present a complete digital signature message stream, just the way the RSA digital signature scheme does it. We will focus on the operations with large numbers due to the fact that operating with large numbers is the essence of RSA that cannot be understood by the usual illustrative examples with small numbers[1].
منابع مشابه
Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model
In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA assumption. The idea behind the construction is that given any valid partial signature of message m, if a co-signer with its auxiliary input is able to generate variables called the resolution of message m such that the distribution of the variables is indistinguishab...
متن کاملVerifiably Committed Signatures Provably Secure in The Standard Complexity Model
In this paper, we study the security notions of verifiably committed signatures by introducing privacy and cut-off time, and then we propose the first scheme which is provably secure in the standard complexity model based on the strong RSA assumption. The idea behind the construction is that given any valid partial signature of messages, if a co-signer with its auxiliary input is able to genera...
متن کاملThe Mathematical Cryptography of the RSA Cryptosystem
Invented in 1977 by Rivest, Shamir and Adleman, the RSA cryptosystem has played a very important role in the development of modern cryptography. Its various applications in industry, Internet, banking, online shopping, cell phones, smart cards, secure information transfers and electronic signatures have made RSA a standard at the heart of modern technologies. This chapter explores the mathemati...
متن کاملSetup-driving Verifiably Committed Signatures Within Standard Complexity Mode
In this paper, a setup-driving verifiably committed signature based on the strong RSA assumption within the standard complexity model is presented. The idea behind our construction is that given any valid partial signature of a message m, if an arbitrator with its auxiliary input is able to generate variables called the resolution of messagem such that the distribution of the resulting variable...
متن کاملDouble voter perceptible blind signature based electronic voting protocol
Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1304.3309 شماره
صفحات -
تاریخ انتشار 2013